Lattice polytopes in coding theory
نویسنده
چکیده
In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also include a new inductive bound for the minimum distance of generalized toric codes. As an application, we give new formulas for the minimum distance of generalized toric codes for special lattice point configurations. 2010 MSC: 14M25, 14G50, 52B20
منابع مشابه
Linear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملConvex Lattice Polytopes and Cones with Few Lattice Points Inside, from a Birational Geometry Viewpoint
It is pretty well-known that toric Fano varieties of dimension k with terminal singularities correspond to convex lattice polytopes P ⊂ R of positive finite volume, such that P ⋂ Z consists of the point 0 and vertices of P (cf., e.g. [10], [36]). Likewise, Q−factorial terminal toric singularities essentially correspond to lattice simplexes with no lattice points inside or on the boundary (excep...
متن کاملLattices generated by skeletons of reflexive polytopes
Lattices generated by lattice points in skeletons of reflexive polytopes are essential in determining the fundamental group and integral cohomology of Calabi-Yau hypersurfaces. Here we prove that the lattice generated by all lattice points in a reflexive polytope is already generated by lattice points in codimension two faces. This answers a question of J. Morgan.
متن کامل7 Lattice Points and Lattice Polytopes
Lattice polytopes arise naturally in algebraic geometry, analysis, combinatorics, computer science, number theory, optimization, probability and representation theory. They possess a rich structure arising from the interaction of algebraic, convex, analytic, and combinatorial properties. In this chapter, we concentrate on the theory of lattice polytopes and only sketch their numerous applicatio...
متن کاملExamples of Non-symmetric Kähler-einstein Toric Fano Manifolds
Let us first recall our setting. In the toric case, there is a correspondence between n-dimensional nonsingular Fano varieties and ndimensional Fano polytopes, where the Fano varieties are biregular isomorphic if and only if the corresponding Fano polytopes are unimodularly equivalent. Here, given a lattice N of rank n, a Fano polytope Q ⊆ NR := N ⊗Z R is given as a lattice polytope containing ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1411.0028 شماره
صفحات -
تاریخ انتشار 2014